Signed Networks, Triadic Interactions and the Evolution of Cooperation
نویسندگان
چکیده
Introduction. In this paper we examine how cooperation can be supported by negative ties and triadic interactions. Previous research has demonstrated that cooperation is more likely to evolve in social dilemma games, such as the Prisoners Dilemma, if the game is played in networks [1, 4, 5, 12]. Besides sparseness [3, 4, 5], the structure of the network is also important because on top of direct ties, indirect relations also control behavior and contribute to the establishment of cooperation through reputation mechanisms, such as image scoring [2]. These ideas have been fruitful in explaining why and under which conditions can cooperation evolve and be stable among humans. In these studies however, only positive relations between players are analyzed. Negative ties could potentially be better enforcers of cooperation than positive ones. At the dyadic level, social psychological mechanisms of vengeance and anger are manifested through the use of powerful trigger strategies in the repeated Prisoners Dilemma game [7, 8, 9, 10]. Another mechanism is selectivity that prescribes cooperation with those who are liked and defection with those who are disliked. Experiments demonstrate that subjects play differently in social dilemma games with related and unrelated others (e.g., [6]). There is also evidence of homophilous selection of partners that can stabilize cooperative regimes [11]. Furthermore, we hypothesize that when interactions happen on a triadic basis, cooperation can increase. For instance, if A and B are friends, and C is their common enemy, the presence of the negative ties towards C could strengthen cooperation between A and B. Signed relations could reliably signal cooperative or non-cooperative intentions, and hence could guarantee the spread of appropriate reputational information that result in confirming expectations about cooperation.
منابع مشابه
Emotional Strategies as Catalysts for Cooperation in Signed Networks
The evolution of unconditional cooperation is one of the fundamental problems in science. A new solution is proposed to solve this puzzle. We treat this issue with an evolutionary model in which agents play the Prisoner’s Dilemma on signed networks. The topology is allowed to co-evolve with relational signs as well as with agent strategies. We introduce a strategy that is conditional on the emo...
متن کاملThe Evolution of Community Structure in a Coauthorship Network
Mechanisms such as triadic closure and preferential attachment drive the evolution of social networks. Many models use these mechanisms to predict future links, and they generate realistic networks with scale-free degree distributions. These social networks also have community structure, or sets of vertices which are more connected to each other than the rest of the network. To study the evolut...
متن کاملDegree Variance And Emotional Strategies Catalyze Cooperation In Dynamic Signed Networks
We study the problem of the emergence of cooperation in dynamic signed networks where agent strategies coevolve with relational signs and network topology. Running simulations based on an agent-based model, we compare results obtained in a regular lattice initialization with those obtained on a comparable random network initialization. We show that the increased degree heterogeneity at the outs...
متن کاملBalanced clusters and diffusion process in signed networks
In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...
متن کاملUnintended triadic closure in social networks: The strategic formation of research collaborations between French inventors
The literature on social networks argues that they are clustered because agents like closing triangles (since this facilitates cooperation or increases match quality). However, in certain circumstances, network clustering may arise even though agents actually do not like redundancy in connections. We propose a theoretical model of the formation of new research collaborations that we estimate on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013